Dependency-Based Relative Positional Encoding for Transformer NMT
نویسندگان
چکیده
منابع مشابه
Attention-based Vocabulary Selection for NMT Decoding
Neural Machine Translation (NMT) models usually use large target vocabulary sizes to capture most of the words in the target language. The vocabulary size is a big factor when decoding new sentences as the final softmax layer normalizes over all possible target words. To address this problem, it is widely common to restrict the target vocabulary with candidate lists based on the source sentence...
متن کاملEncoding Generalized Quantifiers in Dependency-based Compositional Semantics
For textual entailment recognition systems, it is often important to correctly handle Generalized quantifiers (GQ). In this paper, we explore ways of encoding GQs in a recent framework of Dependency-based Compositional Semantics, especially aiming to correctly handle linguistic knowledge like hyponymy when GQs are involved. We use both the selection operator mechanism and a new relation extensi...
متن کاملRough Set Based Unsupervised Feature Selection Using Relative dependency Measures
Feature Selection (FS) is a process which attempts to select features which are more informative. It is an important step in knowledge discovery from data. Conventional supervised FS methods evaluate various feature subsets using an evaluation function or metric to select only those features which are related to the decision classes of the data under consideration. However, for many data mining...
متن کاملFeature Selection Based on Relative Attribute Dependency: An Experimental Study
Most existing rough set-based feature selection algorithms suffer from intensive computation of either discernibility functions or positive regions to find attribute reduct. In this paper, we develop a new computation model based on relative attribute dependency defined as the proportion of the projection of the decision table on a condition attributes subset to the projection of the decision t...
متن کاملA Relative Dependency Pair Framework
Relative rewriting and the dependency pair framework (DP framework) are two strongly related termination methods. In both formalisms we consider whether the combination of two TRSs allows an infinite derivation: Relative termination of R/S can be defined as strong normalization of →R · →S . Finiteness of a DP problem (P,R) can be defined as strong normalization of →P · →R where → allows steps o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Natural Language Processing
سال: 2020
ISSN: 1340-7619,2185-8314
DOI: 10.5715/jnlp.27.281